On the linear complexity profile of some sequences derived from elliptic curves
نویسندگان
چکیده
For a given elliptic curve E over a finite field of odd characteristic and a rational function f on E we first study the linear complexity profiles of the sequences f(nG), n = 1, 2, . . . which complements earlier results of Hess and Shparlinski. We use Edwards coordinates to be able to deal with many f where Hess and Shparlinski’s result does not apply. Moreover, we study the linear complexities of the (generalized) elliptic curve power generators f(enG), n = 1, 2, . . . . We present large families of functions f such that the linear complexity profiles of these sequences are large. 2000 Mathematics Subject Classification: Primary 65C10, 14H52, 94A55, 94A60
منابع مشابه
Efficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملOn lattice profile of the elliptic curve linear congruential generators
Lattice tests are quality measures for assessing the intrinsic structure of pseudorandom number generators. Recently a new lattice test has been introduced by Niederreiter and Winterhof. In this paper, we present a general inequality that is satisfied by any periodic sequence. Then, we analyze the behavior of the linear congruential generators on elliptic curves (abbr. EC-LCG) under this new la...
متن کاملComplete characterization of the Mordell-Weil group of some families of elliptic curves
The Mordell-Weil theorem states that the group of rational points on an elliptic curve over the rational numbers is a finitely generated abelian group. In our previous paper, H. Daghigh, and S. Didari, On the elliptic curves of the form $ y^2=x^3-3px$, Bull. Iranian Math. Soc. 40 (2014), no. 5, 1119--1133., using Selmer groups, we have shown that for a prime $p...
متن کاملOn the Linear Complexity and Multidimensional Distribution of Congruential Generators over Elliptic Curves
We show that the elliptic curve analogue of the linear congruential generator produces sequences with high linear complexity and good multidimensional distribution.
متن کاملOn Pseudorandom Properties of Certain Sequences of Points on Elliptic Curve
In this paper we study the pseudorandom properties of sequences of points on elliptic curves. These sequences are constructed by taking linear combinations with small coefficients (e.g. −1, 0,+1) of the orbit elements of a point with respect to a given endomorphism of the curve. We investigate the linear complexity and the distribution of these sequences. The result on the linear complexity ans...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 81 شماره
صفحات -
تاریخ انتشار 2016